A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction
نویسندگان
چکیده
منابع مشابه
A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction
The bi-objective winner determination problem (2WDP-SC) of a combinatorial procurement auction for transport contracts is characterized by a set B of bundle bids, with each bundle bid b ∈ B consisting of a bidding carrier cb, a bid price pb, and a set τb of transport contracts which is a subset of the set T of tendered transport contracts. Additionally, the transport quality qt,cb is given whic...
متن کاملA Genetic Algorithm for a Bi-Objective Winner-Determination Problem in a Transportation-Procurement Auction
This paper introduces a bi-objective winner-determination problem and presents a multiobjective genetic algorithm to solve it. The problem examined arises in the procurement of transportation contracts via combinatorial auctions. It is modeled as an extension to the set-covering problem and considers the minimization of the total procurement costs and the maximization of the service-quality lev...
متن کاملSolving a bi-objective winner determination problem in a transportation procurement auction
This paper introduces a bi-objective winner determination problem which arises in the procurement of transportation contracts via combinatorial auctions. The problem is modelled as an extension to the set covering problem and considers the minimisation of the total procurement costs and the maximisation of the service-quality level of the execution of all transportation contracts tendered. To s...
متن کاملAn improved Ant Colony Algorithm for Optimal Winner Determination Problem in Reverse Combinatorial Auction
Reverse Combinatorial auctions, that is, auctions where bidders can bid on the supply right of combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-item auctions where the agents' valuations of the items are not additive. A common model is formulated for optimal the winner determination problem of reverse combinatorial auction. A PRIM (P...
متن کاملInteger Programming for Combinatorial Auction Winner Determination
Combinatorial auctions are important as they enable bidders to place bids on combinations of items; compared to other auction mechanisms, they often increase the efficiency of the auction, while keeping risks for bidders low. However, the determination of an optimal winner combination in combinatorial auctions is a complex computational problem. In this paper we (i) compare recent algorithms fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2014
ISSN: 0305-0548
DOI: 10.1016/j.cor.2013.04.004